Solving Optimal Control Problem Using Max-Min Ant System
نویسندگان
چکیده
منابع مشابه
MAX-MIN Ant System
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...
متن کاملParallel Max-Min Ant System Using MapReduce
Ant colony optimization algorithms have been successfully applied to solve many problems. However, in some large scale optimization problems involving large amounts of data, the optimization process may take hours or even days to get an excellent solution. Developing parallel optimization algorithms is a common way to tackle with this issue. In this paper, we present a MapReduce Max-Min Ant Sys...
متن کاملSolving Real-world Delivery Problem Using Improved Max-min Ant System with Local Optimal Solutions in Wide Area Road Network
This paper presents a solution to real-world delivery problems (RWDPs) for home delivery services where a large number of roads exist in cities and the traffic on the roads rapidly changes with time. The methodology for finding the shortest-travel-time tour includes a hybrid meta-heuristic that combines ant colony optimization (ACO) with Dijkstra’s algorithm, a search technique that uses both r...
متن کاملSolving Min-Max Vehicle Routing Problem
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of...
متن کاملAn ant colony optimization technique for solving min-max Multi-Depot Vehicle Routing Problem
The Multi-Depot Vehicle Routing Problem (MDVRP) involves minimizing the total distance traveled by vehicles originating from multiple depots so that the vehicles together visit the specified customer locations (or cities) exactly once. This problem belongs to a class of Nondeterministic Polynomial Hard (NP Hard) problems and has been used in literature as a benchmark for development of optimiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2012
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-0134751